The Linear Complexity of Whiteman’s Generalized Cyclotomic Sequences of Period

نویسندگان

  • Liqin Hu
  • Qin Yue
  • Minhong Wang
چکیده

In this paper, we mainly get three results. First, let , be distinct primes with ; we give a method to compute the linear complexity of Whiteman’s generalized cyclotomic sequences of period . Second, if , we compute the exact linear complexity of Whiteman’s generalized cyclotomic sequences. Third, if , , and we fix a common primitive root of both and , then , which is a subgroup of the multiplicative group , if and only if Whiteman’s generalized cyclotomic numbers of order 4 depend on the decomposition with .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6

Abstract. BinaryWhiteman’s cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman’s generalized cyclotomic sequence (WGCS-I) of order d = 6. Our results show that the autocorrelation values of this sequence is four-valued or five-valued if (n1−1)(n2−1)/36...

متن کامل

About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period

We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.

متن کامل

Trace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences

In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multi-rate parallel combinations of binary Legendre sequences which are clocked at different rates. Then these generalized cyclotomic sequences can be generated by combinations of short and cheap LFSR’s. From the multi-rate constructions and the trace representation of binary Legendre seque...

متن کامل

On error linear complexity of new generalized cyclotomic binary sequences of period p2

We consider the k-error linear complexity of a new binary sequence of period p2, proposed in the recent paper “New generalized cyclotomic binary sequences of period p2”, by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623017-0408-7). More exactly, we determine the values of k-error linear complexity over...

متن کامل

On the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six

We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will find the linear complexity of DingHelleseth-generalized cyclotomic sequences of order four and six and make the results of Tongjiang Yan et. al [19] about the sequences of order four more specific. 2010 Mathematics Subject Classifications: 11B50, 9...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012